Cs - R 9536 1995
نویسندگان
چکیده
The coalgebraic perspective on objects and classes in object-oriented programming is elaborated: objects consist of a (unique) identiier, a local state, and a collection of methods described as a coalgebra; classes are coalgebraic (behavioural) speciications of objects. The creation of a \new" object of a class is described in terms of the terminal coalgebra satisfying the speciication. We present a notion of \totally speciied" class, which leads to particularly simple terminal coalgebras. We further describe local and global operational semantics for objects. Associated with the local operational semantics is a notion of bisimulation (for objects belonging to the same class), expressing observational indistinguishability.
منابع مشابه
Dynamic whole-arm dexterous manipulation in the plane
A dynamic model Whole-Arm Dexterous Manipulation In The Plane S.L. Yeap J.C. Trinkle Dept. of CS syeap@cs. tamu.edu Dept. of CS trink@cs . t amu.edu Texas A&M University, College Station, TX 77843-31 12 ' of a dexterous manipulation system can be used for predicting the feasibility of a manipulation plan generated under the quasistatic assumption but executed under dynamic conditions. Contact f...
متن کاملInvolvement of CD45 in adhesion and suppression of apoptosis of mouse malignant T-lymphoma cells.
Mouse malignant T-lymphoma CS-21 cells undergo apoptotic cell death in vitro in the absence of lymph node stromal cells but escape apoptosis and proliferate when they are attached to CA-12 stromal cells. A monoclonal antibody raised against CS-21 cell surface molecules (MCS-5) recognized a M(r) 168,000 protein, inhibited binding of CS-21 cells to CA-12 stromal cells, and suppressed apoptosis in...
متن کاملDimension Reduction for Finite Trees in ℓ 1
We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...
متن کامل